Multiplying Concept Sources for Graph Modeling

نویسندگان

  • Loïc Maisonnasse
  • Éric Gaussier
  • Jean-Pierre Chevallet
چکیده

This paper presents the LIG contribution to the CLEF 2007 medical retrieval task (i.e. ImageCLEFmed). The main idea in this paper is to incorporate medical knowledge in the language modeling approach to information retrieval (IR). Our model makes use of the textual part of ImageCLEFmed corpus and of the medical knowledge as found in the Unified Medical Language System (UMLS) knowledge sources. The use of UMLS allows us to create a conceptual representation of each sentence in the corpus. We use these sentence representations to create a graph model for each document. As in the standard language modeling approach, we evaluate the probability that a document graph model generates the query graph. Graphs are created from medical texts and queries, and are built for different languages, with different methods. The use of a conceptual representation allows the system to work at a higher semantic level, which solves some of the information retrieval problems, as term variation. After developing the graph model in the first part of the paper, we present our tests, which involve mixing different concepts sources (i.e. languages and methods) for the matching of the query and text graphs. Results show that using language model on concepts provides good results in IR. Multiplying the concept sources further improves the results. Lastly, using relations between concepts (provided by the graphs under consideration) improves results when only few conceptual sources are used to analyze the query.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliability analysis of suspension bridges against buffeting failure

A reliability analysis of suspension bridges against buffeting failure due to gustiness of wind velocity is carried out using the concept of PRA (probabilistic risk analysis) procedure. For this purpose, the bending stresses at the critical nodes of the bridge deck are obtained for buffeting forces using a spectral analysis technique and a finite element approach. For the purpose of reliability...

متن کامل

An Effective Method for Utility Preserving Social Network Graph Anonymization Based on Mathematical Modeling

In recent years, privacy concerns about social network graph data publishing has increased due to the widespread use of such data for research purposes. This paper addresses the problem of identity disclosure risk of a node assuming that the adversary identifies one of its immediate neighbors in the published data. The related anonymity level of a graph is formulated and a mathematical model is...

متن کامل

تعبیه ی هندسی درخت درنقاط داخل یک چندضلعی با حداقل تعداد خم

In this paper we consider to embed a tree T with N vertices on a set of N points inside a simple polygon on n vertices and the goal is to minimize the number of bends. The main idea of our algorithm is modeling the problem into graph matching problem and uses the graph matching algorithms. We apply the concept of error-correction transformation and find the appropriate cost function then we per...

متن کامل

Solving a nurse rostering problem considering nurses preferences by graph theory approach

Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...

متن کامل

Nordhaus-Gaddum type results for the Harary index of graphs

The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007